Bottlenecks in Dendroids
نویسنده
چکیده
A subcontinuum C of a dendroid X is a bottleneck if it intersects every arc connecting two nonempty open subsets of X. We prove that every dendroid has a point p contained in arbitrarily small bottlenecks. Moreover, every plane dendroid contains a single point bottleneck. This implies, for instance, that each map from an indecomposable continuum into a plane dendroid must have an uncountable point-inverse. We also construct a map from the simplest indecomposable continuum into a (nonplanar) dendroid with all point-inverses consisting of at most three points.
منابع مشابه
A Collection of Dendroids
An uncountable collection of uniformly arcwise connected plane Suslinian dendroids is constructed which shows that the negations of the following properties: local connectedness, smoothness, pointwise smoothness, hereditary contractibility, and selectibility are not countable in this class of
متن کاملMapping Chainable Continua onto Dendroids
We prove that every chainable continuum can be mapped into a dendroid such that all point-inverses consist of at most three points. In particular, it follows that there exists a finite-to-one map from a hereditarily indecomposable continuum (the pseudoarc) onto hereditarily decomposable continuum. This answers a question by J. Krasinkiewicz.
متن کاملMinimal Sets on Graphs and dendrites
The topological structure of minimal sets of continuous maps on graphs, dendrites and dendroids is studied. A full characterization of minimal sets on graphs and a partial characterization of minimal sets on dendrites are given. An example of a minimal set containing an interval on a dendroid is
متن کاملImproving for Drum_Buffer_Rope material flow management with attention to second bottlenecks and free goods in a job shop environment
Drum–Buffer–Rope is a theory of constraints production planning methodology that operates by developing a schedule for the system’s first bottleneck. The first bottleneck is the bottleneck with the highest utilization. In the theory of constraints, any job that is not processed at the first bottleneck is referred to as a free good. Free goods do not use capacity at the first bottleneck, so very...
متن کامل